Convergence of Jacobi and Gauss-Seidel Method and Error Reduction Factor
نویسندگان
چکیده
منابع مشابه
Convergence and Comparison Theorems of the Modified Gauss-Seidel Method
In this paper, the modified Gauss-Seidel method with the new preconditioner for solving the linear system Ax = b, where A is a nonsingular M -matrix with unit diagonal, is considered. The convergence property and the comparison theorems of the proposed method are established. Two examples are given to show the efficiency and effectiveness of the modified Gauss-Seidel method with the presented n...
متن کاملA Unified Proof for the Convergence of Jacobi and Gauss-Seidel Methods
We present a new unified proof for the convergence of both the Jacobi and the Gauss–Seidel methods for solving systems of linear equations under the criterion of either (a) strict diagonal dominance of the matrix, or (b) diagonal dominance and irreducibility of the matrix. These results are well known. The proof for criterion (a) makes use of Geršgorin’s theorem, while the proof for criterion (...
متن کاملA Comparison of Jacobi and Gauss-Seidel Parallel Iterations
We consider an iterative algorithm in which several components are updated in parallel at each stage. We assume that the underlying iteration mapping is monotone and we show that the speed of convergence is maximized when all components are updated at each iteration.
متن کاملSome p-norm convergence results for Jacobi and Gauss-Seidel iterations
Let A be a matrix such that the diagonal matrix D with the same diagonal as A is invertible. It is well known that if (1) A satisfies the Sassenfeld condition then its Gauss-Seidel scheme is convergent, and (2) if D−1A certifies certain classical diagonal dominance conditions then the Jacobi iterations for A are convergent. In this paper we generalize the second result and extend the first resu...
متن کاملRapid error reduction for block Gauss-Seidel based on p-hierarchical basis
We consider a two-level block Gauss-Seidel iteration for solving systems arising from finite element discretizations employing higher-order elements. A p-hierarchical basis is used to induce this block structure. Using superconvergence results normally employed in the analysis of gradient recovery schemes, we argue that a massive reduction of H1-error occurs in the first iterate, so that the di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOSR Journal of Mathematics
سال: 2012
ISSN: 2319-765X,2278-5728
DOI: 10.9790/5728-0222023